Benefits of Tree Transducers for Optimizing Functional Programs
نویسنده
چکیده
We present a technique to prevent the construction of intermediate data structures in functional programs, which is based on results from the theory of tree transducers. We rst decompose function deen-itions, which correspond to macro tree transducers, into smaller pieces. Under certain restrictions these pieces can be composed to an attributed tree transducer using a composition result for attribute grammars. The same construction can be used to compose the attributed tree transducers , which represent the initial function deenitions.
منابع مشابه
Relating Accumulative and Non-accumulative Functional Programs
A. Middeldorp (Ed.): Rewriting Techniques and Applications. Proceedings. LNCS 2051, pp. 154–168, 2001. c © Springer-Verlag Berlin Heidelberg 2001 Abstract. We study the problem to transform functional programs, which intensively use append functions (like inefficient list reversal), into programs, which use accumulating parameters instead (like efficient list reversal). We give an (automatic) t...
متن کاملComparison of Deforestation Techniques for Functional Programs and for Tree Transducers
We compare transformations for the elimination of intermediate results in rst-order functional programs. We choose the well known deforestation technique of Wadler and composition techniques from the theory of tree transducers, of which the implementation of functional programs yet does not take advantage. We identify syntactic classes of function deenitions for which both techniques deliver eq...
متن کاملImplementation of a Deterministic Partial E-Unification Algorithm for Macro Tree Transducers
During the execution of functional logic programs particular E uni cation pro blems have to be solved quite frequently In this paper we contribute to the e cient solution of such problems in the case where E is induced by particular term rewriting systems called macro tree transducers We formalize the implementation of a deter ministic partial E uni cation algorithm on a deterministic abstract ...
متن کاملComposition of functions with accumulating parameters
Many functional programs with accumulating parameters are contained in the class of macro tree transducers. We present a program transformation technique that can be used to solve the efficiency problems due to creation and consumption of intermediate data structures in compositions of such functions, where classical deforestation techniques fail. In order to do so, given two macro tree transdu...
متن کاملVerification of Tree-Processing Programs via Higher-Order Model Checking
We propose a new method to verify that a higher-order, treeprocessing functional program conforms to an input/output specification. Our method reduces the verification problem to multiple verification problems for higher-order multi-tree transducers, which are then transformed into higher-order recursion schemes and model-checked. Unlike previous methods, our new method can deal with arbitrary ...
متن کامل